Parallel Graduated Assignment Algorithm for Multiple Graph Matching Based on a Common Labelling
نویسندگان
چکیده
منابع مشابه
Graduated Assignment Algorithm for Finding the Common Labelling of a Set of Graphs
In pattern recognition applications, it is useful to represent objects by attributed graphs considering their structural properties. Besides, some graph matching problems need a Common Labelling between vertices of a set of graphs. Computing this Common Labelling is an NP-complete problem. Stateof-the-art algorithms are composed by two steps: in the first, they compute all pairwise labellings a...
متن کاملA Graduated Assignment Algorithm for Graph Matching - Pattern Analysis and Machine Intelligence, IEEE Transactions on
A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated nonconvexity, two-way (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational complexity [O(/m), where land mare the number of links in the two graphs] and robustness in the prese...
متن کاملA Graduated Assignment Algorithm for Graph Matching
A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise. By combining graduated non-convexity (deterministic annealing), two-way (assignment) constraints, and sparsity, large improvements in accuracy and speed are achieved. Its low order computational complexity (O(lm), where l and m are the number of links in the two graphs...
متن کاملGraph matching by relaxation of fuzzy assignments
Graphs are very powerful and widely used representational tools in computer applications. In this paper, we present a relaxation approach to (sub)graph matching based on a fuzzy assignment matrix. The algorithm has a computational complexity of ( 2 ) where and are the number of nodes in the two graphs being matched, and can perform both exact and inexact matching. To illustrate the performance ...
متن کاملA Modified Parallel Heuristic Graph Matching Approach for Solving Task Assignment Problem in Distributed Processor System
Task assignment is one of the most fundamental combinatorial optimization problems. Solving the Task Assignment Problem is very important for many real time and computational scenarios where a lot of small tasks need to be solved by multiple processors simultaneously. In this paper a Heuristic and Parallel Algorithm for Task Assignment Problem is proposed. Results obtained for certain cases are...
متن کامل